Maximal Translational Equivalence Classes of Musical Patterns in Point-Set Representations

نویسندگان

  • Tom Collins
  • David Meredith
چکیده

Representing musical notes as points in pitch-time space causes repeated motives and themes to appear as translationally related patterns that often correspond to maximal translatable patterns (MTPs) [1]. However, an MTP is also often the union of a salient pattern with one or two temporally isolated notes. This has been called the problem of isolated membership [2]. Examining the MTPs in musical works suggests that salient patterns may correspond more often to the intersections of MTPs than to the MTPs themselves. This paper makes a theoretical contribution, by exploring properties of patterns that are maximal with respect to their translational equivalence classes (MTEC). We prove that a pattern is MTEC if and only if it can be expressed as the intersection of MTPs. We also prove a relationship between MTECs and so-called conjugate patterns.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Point-set Compression to Classify Folk Songs

Thirteen different compression algorithms were used to calculate the normalized compression distances (NCDs) between pairs of tunes in the Annotated Corpus of 360 Dutch folk songs from the collection Onder de groene linde. These NCDs were then used in conjunction with the 1-nearest-neighbour algorithm and leaveone-out cross-validation to classify the 360 melodies into tune families. The classif...

متن کامل

Analysing Music with Point-Set Compression Algorithms

Several point-set pattern-discovery and compression algorithms designed for analysing music are reviewed and evaluated. Each algorithm takes as input a point-set representation of a score in which each note is represented as a point in pitch-time space. Each algorithm computes the maximal translatable patterns (MTPs) in this input and the translational equivalence classes (TECs) of these MTPs, ...

متن کامل

On the type of conjugacy classes and the set of indices of maximal subgroups

‎Let $G$ be a finite group‎. ‎By $MT(G)=(m_1,cdots,m_k)$ we denote the type of‎ ‎conjugacy classes of maximal subgroups of $G$‎, ‎which implies that $G$ has exactly $k$ conjugacy classes of‎ ‎maximal subgroups and $m_1,ldots,m_k$ are the numbers of conjugates‎ ‎of maximal subgroups of $G$‎, ‎where $m_1leqcdotsleq m_k$‎. ‎In this paper‎, ‎we‎ ‎give some new characterizations of finite groups by ...

متن کامل

Pattern Induction and matching in polyphonic music and other multidimensional datasets

We present a new algorithm, SIA, which discovers maximal repeated patterns in any set of points in Cartesian spaces of any dimensionality. The worst-case running time of SIA is O(kn2 log2 n) for a k-dimensional dataset of size n. SIATEC is an extension of SIA that generates a set of translational equivalence classes (TECs). If the input represents a musical score then each TEC contains all the ...

متن کامل

The graph of equivalence classes and Isoclinism of groups

‎Let $G$ be a non-abelian group and let $Gamma(G)$ be the non-commuting graph of $G$‎. ‎In this paper we define an equivalence relation $sim$ on the set of $V(Gamma(G))=Gsetminus Z(G)$ by taking $xsim y$ if and only if $N(x)=N(y)$‎, ‎where $ N(x)={uin G | x textrm{ and } u textrm{ are adjacent in }Gamma(G)}$ is the open neighborhood of $x$ in $Gamma(G)$‎. ‎We introduce a new graph determined ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013